See Hasse diagram in All languages combined, or Wiktionary
{ "etymology_text": "Named after Helmut Hasse (1898–1979), though he was not the first to use them.", "forms": [ { "form": "Hasse diagrams", "tags": [ "plural" ] } ], "head_templates": [ { "args": {}, "expansion": "Hasse diagram (plural Hasse diagrams)", "name": "en-noun" } ], "lang": "English", "lang_code": "en", "pos": "noun", "senses": [ { "categories": [ { "kind": "other", "name": "English entries with incorrect language header", "parents": [ "Entries with incorrect language header", "Entry maintenance" ], "source": "w" }, { "kind": "other", "name": "Pages with 1 entry", "parents": [], "source": "w" }, { "kind": "other", "name": "Pages with entries", "parents": [], "source": "w" }, { "kind": "topical", "langcode": "en", "name": "Set theory", "orig": "en:Set theory", "parents": [ "Mathematics", "Formal sciences", "Sciences", "All topics", "Fundamental" ], "source": "w" } ], "glosses": [ "A diagram which represents a finite poset, in which nodes are elements of the poset and arrows represent the order relation between elements. Transitivity of the order relation is tacit, in other words, if x<y and y<z then no arrow is drawn from x to z, but if there is no distinct z between x and y (such that x<z<y) then an arrow is draw from x to y." ], "id": "en-Hasse_diagram-en-noun-7IEd--Q9", "links": [ [ "set theory", "set theory" ], [ "finite", "finite" ], [ "poset", "poset" ], [ "Transitivity", "transitivity" ], [ "tacit", "tacit" ], [ "distinct", "distinct" ] ], "raw_glosses": [ "(set theory) A diagram which represents a finite poset, in which nodes are elements of the poset and arrows represent the order relation between elements. Transitivity of the order relation is tacit, in other words, if x<y and y<z then no arrow is drawn from x to z, but if there is no distinct z between x and y (such that x<z<y) then an arrow is draw from x to y." ], "topics": [ "mathematics", "sciences", "set-theory" ], "wikipedia": [ "Hasse diagram" ] } ], "word": "Hasse diagram" }
{ "etymology_text": "Named after Helmut Hasse (1898–1979), though he was not the first to use them.", "forms": [ { "form": "Hasse diagrams", "tags": [ "plural" ] } ], "head_templates": [ { "args": {}, "expansion": "Hasse diagram (plural Hasse diagrams)", "name": "en-noun" } ], "lang": "English", "lang_code": "en", "pos": "noun", "senses": [ { "categories": [ "English countable nouns", "English entries with incorrect language header", "English eponyms", "English lemmas", "English multiword terms", "English nouns", "Pages with 1 entry", "Pages with entries", "en:Set theory" ], "glosses": [ "A diagram which represents a finite poset, in which nodes are elements of the poset and arrows represent the order relation between elements. Transitivity of the order relation is tacit, in other words, if x<y and y<z then no arrow is drawn from x to z, but if there is no distinct z between x and y (such that x<z<y) then an arrow is draw from x to y." ], "links": [ [ "set theory", "set theory" ], [ "finite", "finite" ], [ "poset", "poset" ], [ "Transitivity", "transitivity" ], [ "tacit", "tacit" ], [ "distinct", "distinct" ] ], "raw_glosses": [ "(set theory) A diagram which represents a finite poset, in which nodes are elements of the poset and arrows represent the order relation between elements. Transitivity of the order relation is tacit, in other words, if x<y and y<z then no arrow is drawn from x to z, but if there is no distinct z between x and y (such that x<z<y) then an arrow is draw from x to y." ], "topics": [ "mathematics", "sciences", "set-theory" ], "wikipedia": [ "Hasse diagram" ] } ], "word": "Hasse diagram" }
Download raw JSONL data for Hasse diagram meaning in English (1.6kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-11-28 from the enwiktionary dump dated 2024-11-21 using wiktextract (65a6e81 and 0dbea76). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.